Invariant Tensors and Graphs
نویسندگان
چکیده
We describe a correspondence between GLn-invariant tensors and graphs. We then show how this correspondence accommodates various types of symmetries and orientations.
منابع مشابه
GLn-INVARIANT TENSORS AND GRAPHS
We describe a correspondence between GLn-invariant tensors and graphs. We then show how this correspondence accommodates various types of symmetries and orientations.
متن کاملOn Relation between the Kirchhoff Index and Laplacian-Energy-Like Invariant of Graphs
Let G be a simple connected graph with n ≤ 2 vertices and m edges, and let μ1 ≥ μ2 ≥...≥μn-1 >μn=0 be its Laplacian eigenvalues. The Kirchhoff index and Laplacian-energy-like invariant (LEL) of graph G are defined as Kf(G)=nΣi=1n-1<...
متن کاملStatistical cosymplectic manifolds and their submanifolds
In this paper, we introduce statistical cosymplectic manifolds and investigate some properties of their tensors. We define invariant and anti-invariant submanifolds and study invariant submanifolds with normal and tangent structure vector fields. We prove that an invariant submanifold of a statistical cosymplectic manifold with tangent structure vector field is a cosymplectic and minimal...
متن کاملAn Ab initio and chemical shielding tensors calculations for Nucleotide 5’-Monophosphates in the Gas phase
Structural and magnetic properties of purine and pyrimidine nucleotides (CMP, UMP, dTMP, AMP, GMP, IMP) were studied at different levels of ab initio molecular orbital theory. These calculations were performed at the hartree-fock level and density functional B3LYP methods. Geometries were fully optimized by following Cs symmetry restrictions. The standard 6-31G** basis set which includes polari...
متن کاملمجموع فاصله بین رئوس گراف
Let G=(V,E) be a graph where v(G) and E(G) are vertices and edges of G, respectively. Sum of distance between vertices of graphs is called wiener invariant. In This paper, we present some proved results on the wiener invariant and some new result on the upper bound of wiener invariant of k-connected graphs.
متن کامل